package bTree.LeetCode;

public class 递增的三元子序列 {
    public boolean increasingTriplet(int[] nums) {
        int length = nums.length;
        if (length==1||length==2){
            return false;
        }
        for(int i=0;i<length-2;i++){
            for (int j=i+1;j<length-1;j++){
                for (int z=j+1;z<length;z++){
                    if(nums[i]<nums[j]&&nums[j]<nums[z]){
                        return true;
                    }
                }
            }
        }
        return false;
    }
}